Complete minimal and totally minimal groups
نویسندگان
چکیده
منابع مشابه
Minimal Complete Shidoku Symmetry Groups
Calculations of the number of equivalence classes of Sudoku boards has to this point been done only with the aid of a computer, in part because of the unnecessarily large symmetry group used to form the classes. In particular, the relationship between relabeling symmetries and positional symmetries such as row/column swaps is complicated. In this paper we focus first on the smaller Shidoku case...
متن کاملDigital cohomology groups of certain minimal surfaces
In this study, we compute simplicial cohomology groups with different coefficients of a connected sum of certain minimal simple surfaces by using the universal coefficient theorem for cohomology groups. The method used in this paper is a different way to compute digital cohomology groups of minimal simple surfaces. We also prove some theorems related to degree properties of a map on digital sph...
متن کاملTotally Real Minimal Tori In
In this paper we show that all totally real superconformal minimal tori in CP 2 correspond with doubly-periodic finite gap solutions of the Tzitzéica equation ωzz̄ = e −2ω − eω. Using the results on the Tzitzéica equation in integrable system theory, we describe explicitly all these tori by Prym-theta functions. Introduction Over the past few years the integrable system approach played an import...
متن کاملminimal, vertex minimal and commonality minimal cn-dominating graphs
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
متن کاملMINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1991
ISSN: 0166-8641
DOI: 10.1016/0166-8641(91)90032-h